Secure Remote Storage Using Oblivious RAM

نویسندگان

  • Giovanni Malloy
  • Georgios Kellaris
  • Kobbi Nissim
چکیده

Oblivious RAM (ORAM) is a protocol that allows a user to access the data she stored on a server while concealing the access pattern. This work attempts to make improvements to the efficiency of Path ORAM, a specific implementation of ORAM when answering range queries. The efficiency is measured as the time to retrieve a set of records. We began our exploration with an off-the-shelf implementation for which the time to retrieve 1,000 records was roughly 50 seconds, and the improvements described herein brought that number down to roughly 7 seconds. This was achieved by streamlining existing code, switching to a simpler database management system, and integrating the use of threading. Ultimately, this work presents a feasible foundation to continue to improve the algorithm for real-world applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remote Oblivious Storage: Making Oblivious RAM Practical

Remote storage of data has become an increasingly attractive and advantageous option, especially due to cloud systems. While encryption protects the data, it does not hide the access pattern to the data. A natural solution is to access remote storage using an Oblivious RAM (ORAM) which provably hides all access patterns. While ORAM is asymptotically efficient, the best existing scheme (Pinkas a...

متن کامل

Memory Access Pattern Protection for Resource-Constrained Devices

We propose a practice-oriented scheme for protecting RAM access pattern. We first consider an instance which relies on the use of a secure (trusted) hardware buffer; it achieves both security and performance levels acceptable in practice by adapting ideas from oblivious RAM mechanisms, yet without the expensive (re-)shuffling of buffers. Another instance requires no special hardware, but as a r...

متن کامل

Distributed Oblivious RAM for Secure Two-Party Computation

We present a new method for secure two-party Random Access Memory (RAM) program computation that does not require taking a program and first turning it into a circuit. The method achieves logarithmic overhead compared to an insecure program execution. In the heart of our construction is a new Oblivious RAM construction where a client interacts with two non-communicating servers. Our two-server ...

متن کامل

Verifiable Oblivious Storage

We formalize the notion of Verifiable Oblivious Storage (VOS), where a client outsourcesthe storage of data to a server while ensuring data confidentiality, access pattern privacy, andintegrity and freshness of data accesses. VOS generalizes the notion of Oblivious RAM (ORAM)in that it allows the server to perform computation, and also explicitly considers data integrityand ...

متن کامل

Path ORAM: An Extremely Simple Oblivious RAM Protocol Citation

We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme known to date with small client storage. We formally prove that Path ORAM has a O(logN) bandwidth cost for blocks of size B = Ω(logN) bits. For such block sizes, Path ORAM is asymptotically better than the best known OR...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016